Counting Small Cliques in 3-uniform Hypergraphs

Many applications of Szemerédi’s Regularity Lemma for graphs are based on the following counting result. If G is an s-partite graph with partition V (G) = ⋃s i=1 Vi, |Vi| = m for all i ∈ [s], and all pairs (Vi, Vj ), 1 i < j s, are -regular of density d, then G contains (1± f( ))d s 2 ms cliques Ks, provided < (d), where f( ) tends to 0 as tends to 0. Guided by the regularity lemma for 3-uniform hypergraphs established earlier by Frankl and Rödl, Nagle and Rödl proved a corresponding counting lemma. Their proof is rather technical, mostly due to the fact that the ‘quasi-random’ hypergraph arising after application of Frankl and Rödl’s regularity lemma is ‘sparse’, and consequently difficult to handle. When the ‘quasi-random’ hypergraph is ‘dense’ Kohayakawa, Rödl and Skokan (J. Combin. Theory Ser. A 97 307–352) found a simpler proof of the counting lemma. Their result applies even to k-uniform hypergraphs for arbitrary k. While the Frankl–Rödl regularity lemma will not render the dense case, in this paper, for k = 3, we are nevertheless able to reduce the harder, sparse case to the dense case. Namely, we prove that a ‘dense substructure’ randomly chosen from the ‘sparse δ-regular structure’ is δ-regular as well. This allows us to count the number of cliques (and other subhypergraphs) using the Kohayakawa–Rödl–Skokan result, and provides an alternative proof of the counting lemma in the sparse case. Since the counting lemma in the dense case applies to k-uniform hypergraphs for arbitrary k, there is a possibility that the approach of this paper can be adopted to the general case as well.